Parallel solution of symmetric positive definite systems with hyperbolic rotations
نویسندگان
چکیده
منابع مشابه
Parallel Numerical Algorithms for Symmetric Positive Definite Linear Systems
We give a matrix factorization for the solution of the linear system Ax = f , when coefficient matrix A is a dense symmetric positive definite matrix. We call this factorization as "WW T factorization". The algorithm for this factorization is given. Existence and backward error analysis of the method are given. The WDWT factorization is also presented. When the coefficient matrix is a symmetric...
متن کاملSeveral Parallel Algorithms for Solving Nonlinear Systems with Symmetric and Positive Definite Jacobians
In this work we describe two sequential algorithms and their parallel counterparts for solving nonlinear systems, when the Jacobian matrix is symmetric and positive definite. This case appears frequently in unconstrained optimization problems. Both algorithms are based on Newton’s method. The first solves the inner iteration with Cholesky decomposition while the second is based on the inexact N...
متن کاملA Parallel Multi-threaded Solver for Symmetric Positive Definite Bordered-Band Linear Systems
We present a multi-threaded solver for symmetric positive de nite linear systems where the coe cient matrix of the problem features a bordered-band non-zero pattern. The algorithms that implement this approach heavily rely on a compact storage format, tailored for this type of matrices, that reduces the memory requirements, produces a regular data access pattern, and allows to cast the bulk of ...
متن کاملParallel Algorithm for Symmetric Positive Definite Banded Linear Systems: A Divide and Conquer Approach
The WZ factorization for the solution of symmetric positive definite banded linear systems when combined with a partitioned scheme, renders a divide and conquer algorithm. The WZ factorization of the coefficient matrix in each block has the properties: the vector [a1, . . . , aβ , 0, . . . , 0, an−β+1, . . . , an] is invariant under the transformation W where β is the semibandwidth of the coeff...
متن کاملSuperfast Solution of Real Positive Definite Toeplitz Systems
Abstract. We describe an implementation of the generalized Schur algorithm for the superfast solution of real positive definite Toeplitz systems of order n + 1, where n = 2ν . Our implementation uses the split-radix fast Fourier transform algorithms for real data of Duhamel. We are able to obtain the nth Szegő polynomial using fewer than 8n log 2 n real arithmetic operations without explicit us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1986
ISSN: 0024-3795
DOI: 10.1016/0024-3795(86)90163-1